package com.leetcode.LC_MED;

import java.util.Arrays;

public class LC279 {
    public int numSquares(int n) {

        int[] dp = new int[n + 1];
        Arrays.fill(dp, Integer.MAX_VALUE);
        dp[0] = 0;
        for (int i = 0; i < n; i++) {
            for (int j = 1; i + j * j <= n; j++) {
                dp[i + j * j] = Math.min(dp[i + j * j], dp[i] + 1);//比较当前和前一个加平方数
            }
        }
        return dp[n];
    }
}
